- discrete log cryptosystem
- криптосистема на основе дискретного логарифмированиякриптосистема на основе дискретного логарифмирования
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
discrete log cryptosystem
Смотреть что такое "discrete log cryptosystem" в других словарях:
List of logarithm topics — This is a list of logarithm topics, by Wikipedia page. See also the list of exponential topics.*Acoustic power *antilogarithm *Apparent magnitude *Bel *Benford s law *Binary logarithm *Bode plot *Henry Briggs *Cologarithm *Common logarithm… … Wikipedia
Taher Elgamal — Dr. Taher Elgamal (Arabic: طاهر الجمل) (born 18 August 1955) is an Egyptian cryptographer. Elgamal is sometimes written as El Gamal or ElGamal, but Elgamal is now preferred. In 1985, Elgamal published a paper titled A Public key Cryptosystem and… … Wikipedia
List of cryptographers — See also: Category:Cryptographers for an exhaustive list. Contents 1 Pre twentieth century 2 World War I and World War II Wartime Cryptographers 3 Other pre computer 4 Modern … Wikipedia
List of Arab Americans — This is a list of famous Arab Americans. ListAcademics*Dr. Imad ad Dean Ahmad teaches religion, science and freedom at the University of Maryland, College Park and directs the Minaret of Freedom Institute. [… … Wikipedia
Three-pass protocol — In cryptography, the three pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. This message protocol should not be… … Wikipedia
Baby-step giant-step — In group theory, a branch of mathematics, the baby step giant step algorithm is a series of well defined steps to compute the discrete logarithm. The discrete log problem is of fundamental importance to the area of public key cryptography. Many… … Wikipedia
Computational hardness assumption — In cryptography, a major goal is to create cryptographic primitives with provable security. In some cases cryptographic protocols are found to have information theoretic security, the one time pad is a common example. In many cases, information… … Wikipedia
Computational Diffie-Hellman assumption — The computational Diffie Hellman (CDH) assumption is the assumption that a certain computational problem within a cyclic group is hard.Consider a cyclic group {mathbb G} of order q. The CDH assumption states that, given :(g,g^a,g^b) for a… … Wikipedia
Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… … Wikipedia
Timeline of quantum computing — Timeline of quantum computers1970s* 1970 Stephen Wiesner invents conjugate coding.* 1973 Alexander Holevo publishes a paper showing that n qubits cannot carry more than n classical bits of information (a result known as Holevo s theorem or Holevo … Wikipedia
One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… … Wikipedia
